Online Linear Optimization with Inventory Management Constraints
نویسندگان
چکیده
منابع مشابه
Online Linear Optimization with Sparsity Constraints
We study the problem of online linear optimization with sparsity constraints in the 1 semi-bandit setting. It can be seen as a marriage between two well-known problems: 2 the online linear optimization problem and the combinatorial bandit problem. For 3 this problem, we provide two algorithms which are efficient and achieve sublinear 4 regret bounds. Moreover, we extend our results to two gener...
متن کاملOnline Linear Optimization with Sparsity Constraints
We study the problem of online linear optimization with sparsity constraints in the 1 semi-bandit setting. It can be seen as a marriage between two well-known problems: 2 the online linear optimization problem and the combinatorial bandit problem. For 3 this problem, we provide two algorithms which are efficient and achieve sublinear 4 regret bounds. Moreover, we extend our results to two gener...
متن کاملOnline Linear Optimization over Permutations with Precedence Constraints
We consider an online linear optimization problem over the set of permutations under some precedence constraints. In this problem, the player is supposed to predict a permutation of n fixed objects at each trial, under the constraints that some objects have higher priority than other objects in each permutation. This problem is naturally motivated by a scheduling problem whose objective is to m...
متن کاملLarge-scale optimization in online-retail inventory management
This thesis studies the related decisions of inventory placement and inventory replenishment in online retail. The placement decision focuses on the selection of fulfillment centers in which to place items, while the replenishment decision concerns the amount of inventory to order for each item. In contrast with traditional retail, a distinctive feature of online retail is the flexibility to sh...
متن کاملOptimization with Linear Complementarity Constraints
A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem where a continuously differentiable function is minimized on a set defined by linear constraints and complementarity conditions on pairs of complementary variables. This problem finds many applications in several areas of science, engineering and economics and is also an important tool for the solu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2020
ISSN: 0163-5999
DOI: 10.1145/3410048.3410053